翻訳と辞書 Words near each other ・ Polla (moth) ・ Pollachi ・ Pollachi (Lok Sabha constituency) ・ Pollachi (State Assembly Constituency) ・ Pollachi division ・ Pollachi Junction railway station ・ Pollachi Mappillai ・ Pollachi taluk ・ Pollachi(North) Block ・ Pollachi(South) Block ・ Pollachius pollachius ・ Pollachius virens ・ Pollack ・ Pollack (crater) ・ Pollack's Rule ・ Pollaczek–Khinchine formula ・ Polladhavan ・ Polladhavan (1980 film) ・ Polladhavan (2007 film) ・ Polladras ・ Pollagh ・ Pollagh (Achill) ・ Pollaiolo ・ Pollak ・ Pollakanth ・ Pollan ・ Pollan (fish) ・ Pollanisus ・ Pollanisus acharon ・ Pollanisus angustifrons Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Pollaczek–Khinchine formula ： ウィキペディア英語版 Pollaczek–Khinchine formula In queueing theory, a discipline within the mathematical theory of probability, the Pollaczek–Khinchine formula states a relationship between the queue length and service time distribution Laplace transforms for an M/G/1 queue (where jobs arrive according to a Poisson process and have general service time distribution). The term is also used to refer to the relationships between the mean queue length and mean waiting/service time in such a model. The formula was first published by Felix Pollaczek in 1930 and recast in probabilistic terms by Aleksandr Khinchin two years later. In ruin theory the formula can be used to compute the probability of ultimate ruin (probability of an insurance company going bankrupt). ==Mean queue length== The formula states that the mean queue length ''L'' is given by :$L\; =\; \backslash rho\; +\; \backslash frac$ where *$\backslash lambda$ is the arrival rate of the Poisson process *$1/\backslash mu$ is the mean of the service time distribution ''S'' *$\backslash rho=\backslash lambda/\backslash mu$ is the utilization *Var(''S'') is the variance of the service time distribution ''S''. For the mean queue length to be finite it is necessary that as otherwise jobs arrive faster than they leave the queue. "Traffic intensity," ranges between 0 and 1, and is the mean fraction of time that the server is busy. If the arrival rate $\backslash lambda\_a$ is greater than or equal to the service rate $\backslash lambda\_s$, the queuing delay becomes infinite. The variance term enters the expression due to Feller's paradox. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Pollaczek–Khinchine formula」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.